More short signatures without random oracles
نویسندگان
چکیده
We construct three new signatures and prove their securities without random oracles. They are motivated, respectively, by Boneh and Boyen [9]’s, Zhang, et al. [45]’s, and Camenisch and Lysyanskaya [14]’s signatures without random oracles. The first two of our signatures are as short as [9, 45]’s state-of-the-art short signatures, and are 17% shorter if the pairings in use admits a Verheul homomorphism or an algebraic tori attack. Our third signature is reducible to a modified LRSW Assumption [31] but without the LRSW Assumption’s hypothesized external signing oracle. New and interesting variants of the q-SDH Assumption, the q-SR (Square Root) Assumption are also presented. New and independently interesting proof techniques extending the two-mode technique of [9] are used, including a combined three-mode simulation and rewinding in the standard model.
منابع مشابه
Yet Another Short Signatures Without Random Oracles from Bilinear Pairings
In recent years, cryptographic protocols based on the bilinear pairings have attracted much attention. One of the most distinguished achievements in this area was the solution to design short signatures. Up to now, there exist two short signature schemes with random oracles and one without random oracles from bilinear pairings. In this paper, we describe another short signature scheme which is ...
متن کامل(Hierarchical Identity-Based) Threshold Ring Signatures without Random Oracles
We construct the first several efficient threshold ring signatures (TRS) without random oracles. Specializing to a threshold of one, they are the first several efficient ring signatures without random oracles after the only earlier instantiation of Chow, Liu, Wei, and Yuen [22]. Further specializing to a ring of just one user, they are the short (ordinary) signatures without random oracles summ...
متن کاملShort Signatures Without Random Oracles
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes withou...
متن کامل(Convertible) Undeniable Signatures Without Random Oracles
We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters’ and Kurosawa and Heng’s schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signature...
متن کاملSequential Aggregate Signatures and Multisignatures Without Random Oracles
We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive from a novel application of a recent signature scheme due to Waters. Signatures in our aggregate signature scheme are sequentially constructed, but knowledge of the order in which messages were signed is not necessary f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005